A Refined Approximation of a Finite Capacity Polling System under ATM Bursty Arrivals
نویسندگان
چکیده
This paper is concerned with both the mean delay and the probability of cell loss that bursty arrivals incur in an ATM switching system which can be modeled as a finite capacity polling system with nonexhaustive cyclic service. The arrival process to each input port of the system is assumed to be bursty and is modeled by an Interrupted Bernoulli Process(IBP). A practical polling system with finite capacity, as the one we deal with here, does not lend itself to an exact solution. In this paper, we introduce an effective approach to provide an analytical approximation. This approach is validated extensively by comparing it against simulation results under different configurations. It is shown that both the mean delays and the cell loss probabilities obtained from this analysis provide highly accurate estimates. A Refined Approximation of a Finite Capacity Polling System · .. Jou, Nilsson, and Lai. 1
منابع مشابه
Tractable Analysis of a Finite Capacity Polling System under Bursty and Correlated Arrivals
This paper is concerned with the mean delay and the probability of cell loss that bursty arrivals incur in an ATM switching system which can be modeled as a finite capacity polling system with nonexhaustive cyclic service. The arrival process to each input port of the system is modeled by a Markov Modulated Bernoulli Process(MMBP) which is able to describe the bursty and correlated nature of th...
متن کاملThe Upper Bounds for Performance Measures of a Finite Capacity Polling System under ATM Bursty Arrivals
This paper focuses on the upper bounds for both the mean delay and the loss probability that bursty arrivals incur in an ATM switching system which can be modeled as a finite capacity polling system with nonexhaustive cyclic service. The arrival process to each input port of the system is assumed to be bursty and is modeled by an Interrupted Bernoulli Process(IBP). We compute the upper bounds f...
متن کاملAdaptive Polling Schemes for an ATM Bus with Bursty Arrivals
We consider a high speed ATM bus, which can serve a small number of stations (~ 16). The bus is slotted and each slot is long enough to contain one ATM cell. Transmission on the bus is controlled by an arbitrator. Each station sends its status information to the arbitrator at regular intervals. Based on this information the arbitrator makes polling decisions. Due to transmission and processing ...
متن کاملAlgorithms for Computing Limit distributions of Oscillating Systems with Finite Capacity
We address the batch arrival systems with finite capacity under partial batch acceptance strategy where service times or rates oscillate between two forms according to the evolution of the number of customers in the system. Applying the theory of Markov regenerative processes and resorting to Markov chain embedding, we present a new algorithm for computing limit distributions of the number cus...
متن کامل